package A1动态规划;

public class LC_674最长连续递增序列_1 {
    public int findLengthOfLCIS(int[] nums) {
        if(nums.length==0||nums==null)
            return 0;
        int res=1;
        int count=1;
        for(int i=1;i<nums.length;i++){
            if(nums[i]>nums[i-1])
                count++;
            else
                count=1;
//            res=Math.max(count,res);
            if(count>res)
                res=count;
        }
        return res;
    }
}
